Asymmetric First-Price Auctions - A Dynamical-Systems Approach
نویسندگان
چکیده
We introduce a new approach for analysis and numerical simulations of asymmetric first-price auctions, which is based on dynamical systems. We apply this approach to asymmetric auctions in which players’ valuations are power-law distributed. We utilize a dynamical-systems formulation to provide a proof of the existence and uniqueness of the equilibrium strategies in the cases of two coalitions and of two types of players. In the case of n different players, the singular point of the original system at b = 0 corresponds to a saddle point of the dynamical system with n− 1 admissible directions. This insight enables us to use forward solutions in the analysis and in the numerical simulations, in contrast with previous analytic and numerical studies that used backward solutions. The dynamical-systems approach provides an intuitive explanation for why the standard backward-shooting method for computing the equilibrium strategies is inherently unstable, and enables us to devise a stable forward-shooting method. In particular, in the case of two types of players, this method is extremely simple, as it does not require any shooting.
منابع مشابه
Asymmetric First-Price Auctions - A Perturbation Approach
We use perturbation analysis to obtain explicit approximations of the equilibrium bids in asymmetric first-price auctions with n bidders, in which bidders’ valuations are independently drawn from different distribution functions. Several applications are presented: explicit approximations of the seller’s expected revenue, the maximal bid, the optimal reserve price, inefficiency, and a consequen...
متن کاملOn the analysis of asymmetric first price auctions
We provide new tools for studying asymmetric first price auctions, connecting their equilibria to the ρ-concavity of the underlying type distributions, and showing how one can use surplus expressions for symmetric auctions to bound equilibrium behavior in asymmetric auctions. We apply these tools to studying procurement auctions in which, as is common in practice, one seller is given an advanta...
متن کاملBid optimization in online advertisement auctions
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and propose a bidding heuristic to optimize the utility for bidders by equalizing the return-on-investment for each bidder across all keywords. We show that natural auction mechanisms combined with this heuristic can experience chaotic cycling (as is the case with many current advertiseme...
متن کاملAn elementary proof of the common maximal bid in asymmetric first-price and all-pay auctions
We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth. © 2013 Elsevier B.V. All rights reserved.
متن کاملNumerical Analysis of Asymmetric First Price Auctions
We propose numerical algorithms for solving first price auction problems where bidders draw independent valuations from heterogeneous distributions. The heterogeneity analyzed in this work is what might naturally emerge when subsets of distributionally homogeneous bidders collude. Bid functions and expected revenues are calculated for two special cases. Extensions to more general asymmetric fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 37 شماره
صفحات -
تاریخ انتشار 2012